Computing the Extensions of Autoepistemic and Default Logics with a Truth Maintenance System
نویسندگان
چکیده
In this pa.per we develop a proof procedure for autoepistemic (AEL) and defalrlt logics (DL), based on translating them into a. Truth Maintenance System (TMS). The translation is decidable if t,he theory consists of a finite number of defaults a.nd premises and classical derivability for the base language is decida.ble. To determine all extensions of a network, we develop variants of Doyle’s labelling algorithms.
منابع مشابه
Combining Default Logic and Autoepistemic Logic
When we work with information from multiple sources, the formats of the knowledge bases may not be uniform. It would be desirable to be able to combine a knowledge base of default rules with one containing autoepistemic formulas. Previous works on relating default logic and autoepistemic logic mostly impose some constraints on autoepistemic logic, and thus are not suitable for combining the two...
متن کاملDigital Systems Laboratory Series A: Research Reports Stratification and Tractability in Nonmonotonic Reasoning Stratiication and Tractability in Nonmonotonic Reasoning
Knowledge-based systems use forms of reasoning that do not satisfy the mono-tonicity property of classical logical reasoning. Therefore, several nonmonotonic logics have been developed for the investigation of theoretical foundations of knowledge-based systems. This work investigates eecient inference procedures for knowledge representation using the framework of nonmonotonic logics. Recent res...
متن کاملModel Checking for Nonmonotonic Logics: Algorithms and Complexity
We study the complexity of model checking in propositional nonmonotonic logics. Specifically, we first define the problem of model checking in such formalisms, based on the fact that several nonmonotonic logics make use of interpretation structures (i.e. default extensions, stable expansions, universal Kripke models) which are more complex than standard interpretations of propositional logic. T...
متن کاملComputing Default Extensions by Reductions on OR
Based on a set of simple logical equivalences we define a rewriting procedure that computes extensions in the propositional fragment of the logic of O introduced by Lakemeyer and Levesque. This logic is capable of representing default logic with the advantage of itself being monotonic, with a clearly defined semantics and a separation of the object level and the meta level. The procedure prepar...
متن کاملEQ-logics with delta connective
In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...
متن کامل